P systems with randomized right-hand sides of rules
نویسندگان
چکیده
منابع مشابه
Hierarchical P Systems with Randomized Right-Hand Sides of Rules
1 Institute of Mathematics and Computer Science Academy of Sciences of Moldova Academiei 5, Chişinău, MD-2028, Moldova [email protected] 2 Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Automation, Huazhong University of Science and Technology Wuhan 430074, China 3 Faculty of Informatics, TU Wien Favoritenstraße 9–11, 1040 Vienna, Au...
متن کاملNew variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملLinear programming with interval right hand sides
In this paper, we study general linear programs in which right handsides are interval numbers. This model is relevant when uncertain and inaccurate factors make di–cult the assignment of a single value to each right handside. When objective function coe–cients are interval numbers in a linear program, it is used to determine optimal solutions according to classical criteria coming from decision...
متن کاملthe block lsmr algorithm for solving linear systems with multiple right-hand sides
lsmr (least squares minimal residual) is an iterative method for the solution of the linear system of equations and leastsquares problems. this paper presents a block version of the lsmr algorithm for solving linear systems with multiple right-hand sides. the new algorithm is based on the block bidiagonalization and derived by minimizing the frobenius norm of the resid ual matrix of normal equa...
متن کاملReducing Right-Hand Sides for Termination
We propose two transformations on term rewrite systems (TRSs) based on reducing right hand sides: one related to the transformation order and a variant of dummy elimination. Under mild conditions we prove that the transformed system is terminating if and only if the original one is terminating. Both transformations are very easy to implement, and make it much easier to prove termination of some...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2020
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2018.07.016